Colour Variation Minimization Retinex Decomposition and Enhancement with a Multi-Branch Decomposition Network

نویسندگان

چکیده

This paper proposes a colour variation minimization retinex decomposition and enhancement with multi-branch network (CvmD-net) to remove single image darkness. The overcomes the problem that deep learning model relies on matching bright images process dark images. Specifically, our method takes two stages light up darkness in initial images: brightness optimization. We propose an input constant feature prior mechanism (ICFP) based reflection features. extracts structure from constrains reflected output reduce color distortion artifacts. noise amplification during is addressed by network. Sub-networks different structures are employed focus prediction tasks. reference for brightness. optimizes distribution calculating of Experimental results benchmark datasets, namely, LOL ZeroDCE, demonstrate proposed can better balance dense interference restoration. For evaluation real images, we collect Skynet at night verify performance approach. Compared state-of-the-art non-reference decomposition-enhancement models, this has best

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain Decomposition Methods for Total Variation Minimization

Domain decomposition methods are well-known techniques to address a very large scale problem by splitting it into smaller scale sub-problems. The theory of such methods is fully clarified when the energy minimized by the method is either smooth and strictly convex or splits additively with respect to the decomposition. Otherwise counterexamples to convergence exist. In this talk we present a co...

متن کامل

Hypertree-decomposition via Branch-decomposition

Hypertree-decomposition is the most general approach in the literature for identifying tractable computation problems encoded as hypergraphs. We show how the heuristic branch-decomposition approach for ordinary graphs of [Cook and Seymour, 2003] can be used for the heuristic construction of hypertree-decompositions.

متن کامل

Benders decomposition for Supply Chain Network Redesign with Capacity planning and Multi-Period Pricing

Managing income is a considerable dimension in supply chain management in current economic atmosphere. Real world situation makes it inevitable not to design or redesign supply chain. Redesign will take place as costs increase or new services for customers’ new demands should be provided. Pricing is an important fragment of Supply chain due to two reasons: first, represents revenue based ...

متن کامل

A convergent overlapping domain decomposition method for total variation minimization

In this paper we are concerned with the analysis of convergent sequential and parallel overlapping domain decomposition methods for the minimization of functionals formed by a discrepancy term with respect to the data and a total variation constraint. To our knowledge, this is the first successful attempt of addressing such a strategy for the nonlinear, nonadditive, and nonsmooth problem of tot...

متن کامل

Multi-scale retinex for color image enhancement

The retinex is a human perception-based image processing algorithm which provides color constancy and dynamic range compression. We have previously reported on a single-scale retinex (SSR) and shown that it can either achieve color/lightness rendition or dynamic range compression, but not both simultaneously. We now present a multi-scale retinex (MSR) which overcomes this limitation for most sc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Chinese Journal of Electronics

سال: 2023

ISSN: ['1022-4653', '2075-5597']

DOI: https://doi.org/10.23919/cje.2021.00.350